Necessary and sufficient conditions for quasi-strongly regularity of Graph Product
نویسندگان
چکیده
منابع مشابه
Necessary and Sufficient Conditions for a Hamiltonian Graph
A graph is singular if the zero eigenvalue is in the spectrum of its 0-1 adjacency matrix A. If an eigenvector belonging to the zero eigenspace of A has no zero entries, then the singular graph is said to be a core graph. A (κ, τ)-regular set is a subset of the vertices inducing a κ-regular subgraph such that every vertex not in the subset has τ neighbours in it. We consider the case when κ = τ...
متن کاملSufficient and necessary conditions for the regularity of planar Coons maps
We consider the problem of characterizing whether a Coons map is a diffeomorphism from the unit square onto a planar domain delineated by four given curves. We aim primarily at having not only theoretically correct conditions but also practically efficient methods. Throughout the paper we suppose that the given four boundary curves are presented in Bézier forms. We will prove three sufficient c...
متن کاملEla Forty Necessary and Sufficient Conditions for Regularity of Interval Matrices: a Survey∗
This is a survey of forty necessary and sufficient conditions for regularity of interval matrices published in various papers over the last thirty-five years. A full list of references to the sources of all the conditions is given, and they are commented on in detail.
متن کاملNecessary and Sufficient Conditions for Almost Regularity of Uniform Birkhoff Interpolation Schemes
In this article, using a combination of the necessary and sufficient conditions for the almost regularity of an interpolation scheme, we will determine all plane uniform Birkhoff schemes, when the set of interpolated nodes has n elements and the set of derivatives we are interpolating with is )} 0 , 1 ( ), 0 , 0 {( = A . For the same A we will determine all rectangular Birkhoff uniform interpol...
متن کاملNecessary and Sufficient Conditions for Copositive Tensors
In this paper, it is proved that a symmetric tensor is (strictly) copositive if and only if each of its principal subtensors has no (non-positive) negative H++-eigenvalue. Necessary and sufficient conditions for (strict) copositivity of a symmetric tensor are also given in terms of Z++-eigenvalues of the principal sub-tensors of that tensor. This presents a method for testing (strict) copositiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science and Cybernetics
سال: 2018
ISSN: 1813-9663,1813-9663
DOI: 10.15625/1813-9663/34/2/12489